Evolutionary Optimization of COVID-19 Vaccine Distribution With Evolutionary Demands

Vaccination uptake has become the key factor that will determine our success in containing the coronavirus pneumonia (COVID-19) pandemic. Efficient distribution of vaccines to inoculation spots is crucial to curtailing the spread of the novel COVID-19 pandemic. Normally, in a big city, a huge number of vaccines need to be transported from central depot(s) through a set of satellites to widely scattered inoculation spots by special-purpose vehicles every day. Such a large two-echelon vehicle routing problem is computationally difficult. Moreover, the demands for vaccines evolve with the epidemic spread over time, and the actual demands are hard to determine early and exactly, which not only increases the problem difficulty but also prolongs the distribution time. Based on our practical experience of COVID-19 vaccine distribution in China, we present a hybrid machine learning and evolutionary computation method, which first uses a fuzzy deep learning model to forecast the demands for vaccines for each next day, such that we can predistribute the forecasted number of vaccines to the satellites in advance;after obtaining the actual demands, it uses an evolutionary algorithm (EA) to route vehicles to distribute vaccines from the satellites/depots to the inoculation spots on each day. The EA saves historical problem instances and their high-quality solutions in a knowledge base, so as to capture inherent relationship between evolving problem inputs to solutions;when solving a new problem instance on each day, the EA utilizes historical solutions that perform well on the similar instances to improve initial solution quality and, hence, accelerate convergence. Computational results on real-world instances of vaccine distribution demonstrate that the proposed method can produce solutions with significantly shorter distribution time compared to state-of-the-arts and, hence, contribute to accelerating the achievement of herd immunity.

A recovery planning model for online business operations under the COVID-19 outbreak

This study analytically develops a new recovery planning optimisation model for managing the impacts of the recent COVID-19 outbreak for online business operations. Firstly, a mathematical model for the ideal plan is designed and then extended to generate a recovery plan in a finite planning horizon that maximises total profit. Recovery plans are generated considering two scenarios, namely the dynamic and uncertain situations. For the dynamic situation, a realistic system with time-dependent and dynamic demand, supply, and warehouse capacity for investigating the impacts of the COVID-19 outbreak is developed using several measures, such as collaborating with emergency suppliers, increasing warehouse capacity, and considering back-orders and lost sales to form recovery strategies. For the uncertain situation, demand, supply, and warehouse capacities are considered as uncertain variables. Further, an innovative solution approach using an adapted differential evolution technique, which is capable of (i) generating long-term recovery plans and (ii) solving both small- and large-scale problems, is developed. The results are illustrated using numerical analyses and simulation experiments. A sensitivity analysis is also conducted. In practice, the proposed optimisation model will assist the decision-makers of online business operations facing the COVID-19 outbreak to decide the optimal recovery plans.

Curbing Pandemic Through Evolutionary Algorithm-Based Priority Aware Mobility Scheduling

COVID-19 is a global pandemic caused by the Severe Acute Respiratory Syndrome Coronavirus 2. While swift vaccine development and distribution have arrested the infection spread rate, it is necessary to design public policies that inform human mobility to curb outbreaks from future strains of the virus. While existing non-pharmaceutical approaches employing network science and machine learning offer promising travel policy solutions, they are guided by epidemiological and economic considerations alone and not human itineraries. We introduce an evolutionary algorithm (EA) based mobility scheduler that incorporates the personalized itineraries of individuals to determine the ideal timing of their mobility. We mathematically analyze the computational efficiency versus the optimality trade-off of the mobility scheduler. Through extensive simulations, we demonstrate that the EA-based mobility scheduler can balance the trade-off between (1) optimality and computational cost and (2) fair and preferential human mobility while reducing contagion under lockdown and no-lockdown as well as even and uneven human mobility traffic scenarios. We show that for two human mobility models, the scheduler exhibits lower infection numbers than a baseline trip-planning approach that directs human traffic along the least congested route to minimize contagion. We discuss that the EA scheduler lends itself to intricate mobility schedules of multiple destination choices with varying priorities and socioeconomic and demographic considerations.

Dynamic Candidate Solution Boosted Beluga Whale Optimization Algorithm for Biomedical Classification

In many fields, complicated issues can now be solved with the help of Artificial Intelligence (AI) and Machine Learning (ML). One of the more modern Metaheuristic (MH) algorithms used to tackle numerous issues in various fields is the Beluga Whale Optimization (BWO) method. However, BWO has a lack of diversity, which could lead to being trapped in local optimaand premature convergence. This study presents two stages for enhancing the fundamental BWO algorithm. The initial stage of BWO's Opposition-Based Learning (OBL), also known as OBWO, helps to expedite the search process and enhance the learning methodology to choose a better generation of candidate solutions for the fundamental BWO. The second step, referred to as OBWOD, combines the Dynamic Candidate Solution (DCS) and OBWO based on the k-Nearest Neighbor (kNN) classifier to boost variety and improve the consistency of the selected solution by giving potential candidates a chance to solve the given problem with a high fitness value. A comparison study with present optimization algorithms for single-objective bound-constraint optimization problems was conducted to evaluate the performance of the OBWOD algorithm on issues from the 2022 IEEE Congress on Evolutionary Computation (CEC'22) benchmark test suite with a range of dimension sizes. The results of the statistical significance test confirmed that the proposed algorithm is competitive with the optimization algorithms. In addition, the OBWOD algorithm surpassed the performance of seven other algorithms with an overall classification accuracy of 85.17% for classifying 10 medical datasets with different dimension sizes according to the performance evaluation matrix.

From Prediction to Prescription: Evolutionary Optimization of Nonpharmaceutical Interventions in the COVID-19 Pandemic.

Several models have been developed to predict how the COVID-19 pandemic spreads, and how it could be contained with nonpharmaceutical interventions, such as social distancing restrictions and school and business closures. This article demonstrates how evolutionary AI can be used to facilitate the next step, i.e., determining most effective intervention strategies automatically. Through evolutionary surrogate-assisted prescription, it is possible to generate a large number of candidate strategies and evaluate them with predictive models. In principle, strategies can be customized for different countries and locales, and balance the need to contain the pandemic and the need to minimize their economic impact. Early experiments suggest that workplace and school restrictions are the most important and need to be designed carefully. They also demonstrate that results of lifting restrictions can be unreliable, and suggest creative ways in which restrictions can be implemented softly, e.g., by alternating them over time. As more data becomes available, the approach can be increasingly useful in dealing with COVID-19 as well as possible future pandemics.

A Multipopulation Multiobjective Ant Colony System Considering Travel and Prevention Costs for Vehicle Routing in COVID-19-Like Epidemics

As transportation system plays a vastly important role in combatting newly-emerging and severe epidemics like the coronavirus disease 2019 (COVID-19), the vehicle routing problem (VRP) in epidemics has become an emerging topic that has attracted increasing attention worldwide. However, most existing VRP models are not suitable for epidemic situations, because they do not consider the prevention cost caused by issues such as viral tests and quarantine during the traveling. Therefore, this paper proposes a multi-objective VRP model for epidemic situations, named VRP4E, which considers not only the traditional travel cost but also the prevention cost of the VRP in epidemic situations. To efficiently solve the VRP4E, this paper further proposes a novel algorithm named multi-objective ant colony system algorithm for epidemic situations, termed MOACS4E, together with three novel designs. First, by extending the efficient “multiple populations for multiple objectives” framework, the MOACS4E adopts two ant colonies to optimize the travel and prevention costs respectively, so as to improve the search efficiency. Second, a pheromone fusion-based solution generation method is proposed to fuse the pheromones from different colonies to increase solution diversity effectively. Third, a solution quality improvement method is further proposed to improve the solutions for the prevention cost objective. The effectiveness of the MOACS4E is verified in experiments on 25 generated benchmarks by comparison with six state-of-the-art and modern algorithms. Moreover, the VRP4E in different epidemic situations and a real-world case in the Beijing-Tianjin-Hebei region, China, are further studied to provide helpful insights for combatting COVID-19-like epidemics.

Numerical and Evolutionary Optimization 2020

In [1], Deb et al. survey surrogate modeling approaches for the numerical treatment of multi-objective optimization problems. [...]the authors propose an adaptive switching-based metamodeling approach, yielding results that are highly competitive to the state-of-the-art. [...]the Pareto Tracer is extended for the efficient numerical treatment of general inequalities, which greatly enhances its applicability. [...]in [16], Castañeda-Aviña et al. design an analog circuit, a voltage-controlled oscillator (VCO), optimized using Differential Evolution.

Scheduling Scheme Design of Hotel Service Robot: A Heuristic Algorithm to Provide Personalized Scheme

With the rapid development of machine learning and artificial intelligence, hotel service robots are widely used, but there are many problems to be solved in the scheduling scheme of hotel service robots. In this study, the Pareto optimal definition is used to model the problem, and a nondominated sorting heuristic method including genetic algorithm and differential evolution algorithm is designed to solve this problem. Experimental results show the effectiveness and stability of our algorithm. In addition, compared with the previous methods, the method proposed in this paper can provide a more personalized and reasonable service robot scheduling scheme for hotels. Finally, the hotel can optimize its management and operation and further deepen the degree of hotel intelligence.

Differential evolution and particle swarm optimization against COVID-19.

COVID-19 disease, which highly affected global life in 2020, led to a rapid scientific response. Versatile optimization methods found their application in scientific studies related to COVID-19 pandemic. Differential Evolution (DE) and Particle Swarm Optimization (PSO) are two metaheuristics that for over two decades have been widely researched and used in various fields of science. In this paper a survey of DE and PSO applications for problems related with COVID-19 pandemic that were rapidly published in 2020 is presented from two different points of view: 1. practitioners seeking the appropriate method to solve particular problem, 2. experts in metaheuristics that are interested in methodological details, inter comparisons between different methods, and the ways for improvement. The effectiveness and popularity of DE and PSO is analyzed in the context of other metaheuristics used against COVID-19. It is found that in COVID-19 related studies: 1. DE and PSO are most frequently used for calibration of epidemiological models and image-based classification of patients or symptoms, but applications are versatile, even interconnecting the pandemic and humanities; 2. reporting on DE or PSO methodological details is often scarce, and the choices made are not necessarily appropriate for the particular algorithm or problem; 3. mainly the basic variants of DE and PSO that were proposed in the late XX century are applied, and research performed in recent two decades is rather ignored; 4. the number of citations and the availability of codes in various programming languages seems to be the main factors for choosing metaheuristics that are finally used.

Energy-Aware Bag-of-Tasks Scheduling in the Cloud Computing System Using Hybrid Oppositional Differential Evolution-Enabled Whale Optimization Algorithm

Bag-of-Tasks (BoT) scheduling over cloud computing resources called Cloud Bag-of-Tasks Scheduling (CBS) problem, which is a well-known NP-hard optimization problem. Whale Optimization Algorithm (WOA) is an effective method for CBS problems, which still requires further improvement in exploration ability, solution diversity, convergence speed, and ensuring adequate exploration–exploitation tradeoff to produce superior scheduling solutions. In order to remove WOA limitations, a hybrid oppositional differential evolution-enabled WOA (called h-DEWOA) approach is introduced to tackle CBS problems to minimize workload makespan and energy consumption. The proposed h-DEWOA incorporates chaotic maps, opposition-based learning (OBL), differential evolution (DE), and a fitness-based balancing mechanism into the standard WOA method, resulting in enhanced exploration, faster convergence, and adequate exploration–exploitation tradeoff throughout the algorithm execution. Besides this, an efficient allocation heuristic is added to the h-DEWOA method to improve resource assignment. CEA-Curie and HPC2N real cloud workloads are used for performance evaluation of scheduling algorithms using the CloudSim simulator. Two series of experiments have been conducted for performance comparison: one with WOA-based heuristics and another with non-WOA-based metaheuristics. Experimental results of the first series of experiments reveal that the h-DEWOA approach results in makespan improvement in the range of 5.79–13.38% (for CEA-Curie workloads), 5.03–13.80% (for HPC2N workloads), and energy consumption in the range of 3.21–14.70% (for CEA-Curie workloads) and 10.84–19.30% (for HPC2N workloads) over well-known WOA-based metaheuristics. Similarly, h-DEWOA also resulted in significant performance in comparison with recent state-of-the-art non-WOA-based metaheuristics in the second series of experiments. Statistical tests and box plots also revealed the robustness of the proposed h-DEWOA algorithm.

Generalized Type-2 Fuzzy Parameter Adaptation in the Marine Predator Algorithm for Fuzzy Controller Parameterization in Mobile Robots

This article is oriented to the application of generalized type-2 fuzzy systems in the dynamic adjustment of the parameters of a recent metaheuristic based on nature that follows the rules of the best feeding strategies of predators and prey in ecosystems. This metaheuristic is called fuzzy marine predator algorithm (FMPA) and is presented as an improved variant of the original marine predator algorithm (MPA). The FMPA balances the degree of exploration and exploitation through its iterations according to the advancement of the predator. In the state of the art, it has been shown that type-2 fuzzy increases metaheuristic performance when adapting parameters, although there is also an increase in the execution time. The FMPA with generalized type-2 and interval type-2 parameter adaptations was applied to a group of benchmark functions introduced in the competition on evolutionary computation (CEC2017);the results show that generalized FMPA provides better solutions. A second case for FMPA is also presented, which is the optimal fuzzy control design, in the search for the optimal membership function parameters. A symmetrical distribution of these functions is assumed for reducing complexity in the search process for optimal parameters. Simulations were carried out considering different degrees of noise when analyzing the performance when simulating each of the used fuzzy methods.

Evolutionary Optimization of COVID-19 Vaccine Distribution with Evolutionary Demands

Vaccination uptake has become the key factor that will determine our success in containing the COVID-19 pandemic. Efficient distribution of vaccines to inoculation spots is crucial to curtailing the spread of the novel coronavirus pneumonia (COVID-19) pandemic. Normally, in a big city, a huge number of vaccines need to be transported from central depot(s) through a set of satellites to widely-scattered inoculation spots by special-purpose vehicles every day. Such a large two-echelon vehicle routing problem is computationally difficult. Moreover, the demands for vaccines evolve with the epidemic spread over time, and the actual demands are hard to determine early and exactly, which not only increases the problem difficulty but also prolongs the distribution time. Based on our practical experience of COVID-19 vaccine distribution in China, we present a hybrid machine learning and evolutionary computation method, which first uses a fuzzy deep learning model to forecast the demands for vaccines for each next day, such that we can pre-distribute the forecasted number of vaccines to the satellites in advance;after obtaining the actual demands, it uses an evolutionary algorithm (EA) to route vehicles to distribute vaccines from the satellites/depots to the inoculation spots on each day. The EA saves historical problem instances and their high-quality solutions in a knowledge base, so as to capture inherent relationship between evolving problem inputs to solutions;when solving a new problem instance on each day, the EA utilizes historical solutions that perform well on the similar instances to improve initial solution quality and hence accelerate convergence. Computational results on real-world instances of vaccine distribution demonstrate that the proposed method can produce solutions with significantly shorter distribution time compared to state-of-the-arts, and hence contribute to accelerating the achievement of herd immunity. IEEE

Prophesying the Short-Term Dynamics of the Crude Oil Future Price by Adopting the Survival of the Fittest Principle of Improved Grey Optimization and Extreme Learning Machine

Crude oil market analysis has become one of the emerging financial markets and the volatility effect of the market is paramount and has been considered as an issue of utmost importance. This study examines the dynamics of this volatile market of crude oil by employing a hybrid approach based on an extreme learning machine (ELM) as a regressor and the improved grey wolf optimizer (IGWO) for prophesying the crude oil rate for West Texas Intermediate (WTI) and Brent crude oil datasets. The datasets are augmented using technical indicators (TIs) and statistical measures (SMs) to obtain better insight into the forecasting ability of this proposed model. The differential evolution (DE) strategy has been used for evolution and the survival of the fittest (SOF) principle has been used for elimination while implementing the GWO to achieve better convergence rate and accuracy. Whereas, the algorithmic simplicity, use of less parameters, and easy implementation of DE efficiently decide the evolutionary patterns of wolves in GWO and the SOF principle updates the wolf pack based on the fitness value of each wolf, thereby ensuring the algorithm does not fall into local optimum. Furthermore, the comparison and analysis of the proposed model with other models, such as ELM–DE, ELM–Particle Swarm Optimization (ELM–PSO), and ELM–GWO shows that the predictability evidence obtained substantially achieves better performance for ELM–IGWO with respect to faster error convergence rate and mean square error (MSE) during training and testing phases. The sensitivity study of the proposed ELM–IGWO provides better results in terms of the performance measures, such as Theil’s U, mean absolute error (MAE), average relative variance (ARV), mean average percentage error (MAPE), and minimal computational time.

LCOS-SLM Based Intelligent Hybrid Algorithm for Beam Splitting

The iterative Fourier transform algorithm (IFTA) is widely used in various optical communication applications based on liquid crystal on silicon spatial light modulators. However, the traditional iterative method has many disadvantages, such as a poor effect, an inability to select an optimization direction, and the failure to consider zero padding or phase quantization. Moreover, after years of development, the emergence of various variant algorithms also makes it difficult for researchers to choose one. In this paper, a new intelligent hybrid algorithm that combines the IFTA and differential evolution algorithm is proposed in a novel way. The reliability of the proposed algorithm is verified by beam splitting, and the IFTA and symmetrical IFTA algorithms, for comparison, are introduced. The hybrid algorithm improves the defects above while considering the zero padding and phase quantization of a computer-generated hologram, which optimizes the directional optimization in the diffraction efficiency and the fidelity of the output beam and improves the results of these two algorithms. As a result, the engineers’ trouble in the selection of an algorithm has also been reduced.

Pandemic Search Algorithm: A Metaheuristic Inspiration of COVID-19 Outbreak

Quick escalation of the Coronavirus crisis from epidemic to pandemic was unprecedented. A relatively longer asymptomatic period is a key feature of COVID-19 in rapid expansion. This paper suggests a search strategy inspired by the pandemic model of airborne disease transmission. The algorithm is based on straightforward principles globally experienced through the COVID-19 pandemic. Asymptomatic period, social distance, and reproduction numbers are fundaments of the Pandemic Search Algorithm (PSA). The performance assessment results compared to the Genetic Algorithm (GA) and Population Swarm optimization (PSO) indicate that PSA is a cost-effective method to establish a compromise between convergence rate and processing time. It can be privileged in computational problems exploring large feasible spaces due to lighter calculations, simpler structures, easier implementation, and tuning. © 2021 IEEE.

A novel deep neuroevolution-based image classification method to diagnose coronavirus disease (COVID-19).

COVID-19 has had a detrimental impact on normal activities, public safety, and the global financial system. To identify the presence of this disease within communities and to commence the management of infected patients early, positive cases should be diagnosed as quickly as possible. New results from X-ray imaging indicate that images provide key information about COVID-19. Advanced deep-learning (DL) models can be applied to X-ray radiological images to accurately diagnose this disease and to mitigate the effects of a shortage of skilled medical personnel in rural areas. However, the performance of DL models strongly depends on the methodology used to design their architectures. Therefore, deep neuroevolution (DNE) techniques are introduced to automatically design DL architectures accurately. In this paper, a new paradigm is proposed for the automated diagnosis of COVID-19 from chest X-ray images using a novel two-stage improved DNE Algorithm. The proposed DNE framework is evaluated on a real-world dataset and the results demonstrate that it provides the highest classification performance in terms of different evaluation metrics.

Genetic-based adaptive momentum estimation for predicting mortality risk factors for COVID-19 patients using deep learning.

The mortality risk factors for coronavirus disease (COVID-19) must be early predicted, especially for severe cases, to provide intensive care before they develop to critically ill immediately. This paper aims to develop an optimized convolution neural network (CNN) for predicting mortality risk factors for COVID-19 patients. The proposed model supports two types of input data clinical variables and the computed tomography (CT) scans. The features are extracted from the optimized CNN phase and then applied to the classification phase. The CNN model's hyperparameters were optimized using a proposed genetic-based adaptive momentum estimation (GB-ADAM) algorithm. The GB-ADAM algorithm employs the genetic algorithm (GA) to optimize Adam optimizer's configuration parameters, consequently improving the classification accuracy. The model is validated using three recent cohorts from New York, Mexico, and Wuhan, consisting of 3055, 7497,504 patients, respectively. The results indicated that the most significant mortality risk factors are: CD 8+ T Lymphocyte (Count), D-dimer greater than 1 Ug/ml, high values of lactate dehydrogenase (LDH), C-reactive protein (CRP), hypertension, and diabetes. Early identification of these factors would help the clinicians in providing immediate care. The results also show that the most frequent COVID-19 signs in CT scans included ground-glass opacity (GGO), followed by crazy-paving pattern, consolidations, and the number of lobes. Moreover, the experimental results show encouraging performance for the proposed model compared with different predicting models.

An oppositional-Cauchy based GSK evolutionary algorithm with a novel deep ensemble reinforcement learning strategy for COVID-19 diagnosis.

A novel coronavirus (COVID-19) has globally attracted attention as a severe respiratory condition. The epidemic has been first tracked in Wuhan, China, and has progressively been expanded in the entire world. The growing expansion of COVID-19 around the globe has made X-ray images crucial for accelerated diagnostics. Therefore, an effective computerized system must be established as a matter of urgency, to facilitate health care professionals in recognizing X-ray images from COVID-19 patients. In this work, we design a novel artificial intelligent-based automated X-ray image analysis framework based on an ensemble of deep optimized convolutional neural networks (CNNs) in order to distinguish coronavirus patients from non-patients. By developing a modified version of gaining-sharing knowledge (GSK) optimization algorithm using the Opposition-based learning (OBL) and Cauchy mutation operators, the architectures of the deployed deep CNNs are optimized automatically without performing the general trial and error procedures. After obtaining the optimized CNNs, it is also very critical to identify how to decrease the number of ensemble deep CNN classifiers to ensure the classification effectiveness. To this end, a selective ensemble approach is proposed for COVID-19 X-ray based image classification using a deep Q network that combines reinforcement learning (RL) with the optimized CNNs. This approach increases the model performance in particular and therefore decreases the ensemble size of classifiers. The experimental results show that the proposed deep RL optimized ensemble approach has an excellent performance over two popular X-ray image based COVID-19 datasets. Our proposed advanced algorithm can accurately identify the COVID-19 patients from the normal individuals with a significant accuracy of 0.991441, precision of 0.993568, recall (sensitivity) of 0.981445, F-measure of 0.989666 and AUC of 0.990337 for Kaggle dataset as well as an excellent accuracy of 0.987742, precision of 0.984334, recall (sensitivity) of 0.989123, F-measure of 0.984939 and AUC of 0.988466 for Mendely dataset.